G-PRIMER: greedy algorithm for selecting minimal primer set
نویسندگان
چکیده
UNLABELLED G-PRIMER, a web-based primer design program, has been developed to compute a minimal primer set specifically annealed to all the open reading frames in a given microbial genome. This program has been successfully used in the microarray experiment for analyzing the expression of genes in the Xanthomonas campestris genome. AVAILABILITY It is available at http://mammoth.bii.a-star.edu.sg/gprimer/. Its source code is available upon request.
منابع مشابه
An efficient algorithm for minimal primer set selection
SUMMARY We have developed U-PRIMER, a primer design program, to compute a minimal primer set (MPS) for any given set of DNA sequences. The U-PRIMER algorithm, which uses automatic variable fixing and automatic redundant constraint elimination to tackle the binary integer programming problem associated with the MPS selection problem. The program has been tested successfully with 32 adipocyte dev...
متن کاملA Greedy Algorithm for Minimizing the Number of Primers in Multiple PCR Experiments.
The selection of a suitable set of primers is very important for polymerase chain reaction (PCR) experiments. Most existing algorithms for primer selection are concerned with producing a primer pair for each DNA sequence. However, when all the DNA sequences of the target objects are already known, like the approximately 6,000 yeast ORFs, we may want to design a small set of primers to PCR ampli...
متن کاملGreedy Algorithms for Finding a Small Set of Primers Satisfying Cover and Length Resolution Conditions in PCR Experiments.
Selecting a good collection of primers is very important for polymerase chain reaction (PCR) experiments. Most existing algorithms for primer selection are concerned with computing a primer pair for each DNA sequence. In generalizing the arbitrarily primed PCR, etc., to the case that all DNA sequences of target objects are already known, like about 6000 ORFs of yeast, we may design a small set ...
متن کاملImproved algorithms for multiplex PCR primer set selection with amplification length constraints
Numerous high-throughput genomics assays require the amplification of a large number of genomic loci of interest. Amplification is cost-effectively achieved using several short single-stranded DNA sequences called primers and polymerase enzyme in a reaction called multiplex polymerase chain reaction (MP-PCR). Amplification of each locus requires that two of the primers bind to the forward and r...
متن کاملAn Iterative Beam Search Algorithm for Degenerate Primer Selection
AN ITERATIVE BEAM SEARCH ALGORITHM FOR DEGENERATE PRIMER SELECTION by Richard M. Souvenir ADVISOR: Professor W. Zhang December, 2003 Saint Louis, Missouri Single Nucleotide Polymorphism (SNP) Genotyping is an important molecular genetics process in the early stages of producing results that will be useful in the medical field. Due to inherent complexities in DNA manipulation and analysis, many ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bioinformatics
دوره 20 15 شماره
صفحات -
تاریخ انتشار 2004